منابع مشابه
Enhancing a hybrid tableaux algorithm
I couldn't have made this far without the help of many people. To all of them I would like to thank. First of all, thanks mum and dad for all your love, understanding and unconditional support. Thanks for being there when I needed you the most and for encouraging me to go on when I felt like giving up. Thanks for teaching me that everything can be learned and that, in the end, every effort gets...
متن کاملClausal Tableaux for Hybrid PDL
PDL (propositional dynamic logic) [6, 11, 8] is an expressive modal logic invented for reasoning about programs. It extends basic modal logic with expressions called programs. Programs describe relations from states to states and are used to express modalities. Programs are composed with the operators familiar from regular expressions. In addition, they may employ formulas so that conditionals ...
متن کاملTableaux for Quantified Hybrid Logic
We present a (sound and complete) tableau calculus for Quantified Hybrid Logic (QHL). QHL is an extension of orthodox quantified modal logic: as well as the usual 2 and 3 modalities it contains names for (and variables over) states, operators @s for asserting that a formula holds at a named state, and a binder ↓ that binds a variable to the current state. The first-order component contains equa...
متن کاملTerminating Tableaux for Hybrid Logic with Eventualities
We present the first terminating tableau system for hybrid logic with eventualities. The system is designed as a basis for gracefully degrading reasoners. Eventualities are formulas of the form ♦∗s that hold for a state if it can reach in n ≥ 0 steps a state satisfying the formula s. The system is prefix-free and employs a novel clausal form that abstracts away from propositional reasoning. It ...
متن کاملTableaux for Hybrid XPath with Data
We provide a sound, complete and terminating tableau procedure to check satisfiability of downward XPath= formulas enriched with nominals and satisfaction operators. The calculus is inspired by ideas introduced to ensure termination of tableau calculi for certain Hybrid Logics. We prove that even though we increased the expressive power of XPath by introducing hybrid operators, the satisfiabili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Logic
سال: 2010
ISSN: 1570-8683
DOI: 10.1016/j.jal.2010.08.003